Online scheduling on unbounded parallel-batch machines with incompatible job families
نویسندگان
چکیده
منابع مشابه
Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
This research is motivated by a scheduling problem found in the di6usion and oxidation areas of semiconductor wafer fabrication, where the machines can be modeled as parallel batch processors. We attempt to minimize total weighted tardiness on parallel batch machines with incompatible job families and unequal ready times of the jobs. Given that the problem is NP-hard, we propose two di6erent de...
متن کاملAnt Colony Optimization Approaches for Scheduling Jobs with Incompatible Families on Parallel Batch Machines
In this paper, we suggest an Ant Colony System (ACS) to solve a scheduling problem for jobs with incompatible families on parallel batch machines. We are interested in minimizing total weighted tardiness (TWT) of the jobs. Problems of this type have practical importance in semiconductor manufacturing. The ACS scheme includes an efficient local search technique based on swapping jobs across diff...
متن کاملUnbounded parallel batch scheduling with job delivery to minimize makespan
We consider unbounded parallel batch scheduling with job delivery to minimize makespan. When the jobs have identical size, we provide a polynomial-time algorithm. When the jobs have non-identical sizes, we provide a heuristic with a worst-case performance ratio 7/4. c © 2008 Published by Elsevier B.V.
متن کاملA memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival
This paper addresses a scheduling problem motivated by scheduling of diffusion operations in the wafer fabrication facility. In the target problem, jobs arrive at the batch machines at different time instants, and only jobs belonging to the same family can be processed together. Parallel batch machine scheduling typically consists of three types of decisions – batch forming, machine assignment,...
متن کاملOnline Over Time Scheduling on Parallel-Batch Machines: A Survey
Online scheduling is a rapidly developed branch in scheduling theory. In this paper, we present an extensive survey for online over time scheduling on parallel-batch machines. Some open problems are proposed for further research.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.01.023